Non-Blind Barcode Deconvolution by Gradient Projection

نویسندگان

  • Christine Lew
  • Dheyani Malde
  • Ernie Esser
  • Yifei Lou
چکیده

This research examines methods of implying deconvolution to blurry barcode signals with noise. Our goal is to to take these signals and recontrust them, using Yu Mao’s method of Gradient Projection, to be as clear as possible. This research examines the work of Yu Mao [5], alumni from the University of Minnesota. Our research is motivated by Yu Mao’s findings for how to reconstruct binary functions and shapes from incomplete frequency information. The findings are significantly interesting because we are able to understand how a binary function can be reconstructed with a simple convex optimization, while only partial frequency information is available.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Blind Deconvolution of Blurred 1D Barcodes Summer Research Program: iCAMP Barcode Deblurring Box Constraint

Barcode Deblurring is a tool that will become more and more important as smaller and cheaper cameras become the norm amongst the average person. Developing an efficient non-blind deconvolution of a barcode using the box constraint and extensions of it is the primary focus in our research. We experiment with slightly different methods to numerically estimate a barcode with gradient projection fr...

متن کامل

A Robust Method for Blind Deconvolution of Barcode Signals and Nonuniform Illumination Estimation

This paper deals with a joint nonuniform illumination estimation and blind deconvolution for barcode signals. Such optimization problems are highly non convex. A robust method is needed in case of noisy and/or blurred signals and nonuniform illumination. Here, we present a novel method based on a genetic algorithm combining discrete and continuous optimization which is successfully applied to d...

متن کامل

Extrinsic Geometrical Methods for Neural Blind Deconvolution

The present contribution discusses a Riemannian-gradient-based algorithm and a projection-based learning algorithm over a curved parameter space for single-neuron learning. We consider the ‘blind deconvolution’ signal processing problem. The learning rule naturally arises from a criterion-function minimization over the unitary hyper-sphere setting. We consider the blind deconvolution performanc...

متن کامل

Geometrical Structures of FIR Manifold and Multichannel Blind Deconvolution

In this paper we study geometrical structures of the manifold of Finite Impulse Response (FIR) filters, and develop a natural gradient learning algorithm for blind deconvolution. First, A Lie group structure is introduced to the FIR manifold and the Riemannian metric is then derived by using the isometric property of the Lie group. The natural gradient on the FIR manifold is obtained by introdu...

متن کامل

A Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method

Recently, Kundur and Hatzinakos showed that a linear restoration filter designed by using the almost obvious a priori knowledge on the original image, such as (i) nonnegativity of the true image and (ii) the smallest rectangle encompassing the original object, can realize a remarkable performance for a blind image deconvolution problem. In this paper, we propose a new set-theoretic blind image ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012